Goal Programming and Its Variants

نویسندگان

  • John Wang
  • Dajin Wang
  • Aihua Li
چکیده

Within the realm of multicriteria decision making (MCDM) exists a powerful method for solving problems with multiple objectives. Goal programming (GP) was the first multiple-objective technique presented in the literature (Dowlatshahi, 2001). The premise of GP traces its origin back to a linear programming study on executive compensation in 1955 by Charnes, Cooper, and Ferguson even though the specific name did not appear in publications until the 1961 textbook entitled Management Models and Industrial Applications of Linear Programming, also by Charnes and Cooper (Schniederjans, 1995). Initial applications of this new type of modeling technique demonstrated its potential for a variety of applications in numerous different areas. Until the middle of the 1970s, GP applications reported in the literature were few and far between. Since that time, primarily due to influential works by Lee and Ignizio, a noticeable increase of published GP applications and technical improvements has been recognized. The number of case studies, along with the range of fields, to which GP has been and still is being applied is impressive, as shown in surveys by Romero (1991) and Aouni and Kettani (2001). It can be said that GP has been, and still is, the “most widely used multi-criteria decision making technique” (Tamiz, Jones, & Romero, 1998, p. 570).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A goal geometric programming problem (G2P2) with logarithmic deviational variables and its applications on two industrial problems

A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighte...

متن کامل

A goal programming approach for fuzzy flexible linear programming problems

 We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...

متن کامل

A Goal Programming Model for Single Vehicle Routing Problem with Multiple Routes

The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...

متن کامل

A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants

In this article, we propose a special case of two-echelon location-routing problem (2E-LRP) in cash-in-transit (CIT) sector. To tackle this realistic problem and to make the model applicable, a rich LRP considering several existing real-life variants and characteristics named BO-2E-PCLRPSD-TW including different objective functions, multiple echelons, multiple periods, capacitated vehicles, dis...

متن کامل

A SHORT NOTE ON THE RELATIONSHIP BETWEEN GOAL PROGRAMMING AND FUZZY PROGRAMMING FOR VECTORMAXIMUM PROBLEMS

A theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.In this short note it is shown that the relationship does not exist underall circumstances. The necessary correction is proposed.

متن کامل

Providing a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach

Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017